An Entropy Lower Bound for Non-Malleable Extractors
نویسندگان
چکیده
منابع مشابه
An Entropy Lower Bound for Non-Malleable Extractors
A (k, ε)-non-malleable extractor is a function nmExt : {0, 1}×{0, 1} → {0, 1} that takes two inputs, a weak source X ∼ {0, 1} of min-entropy k and an independent uniform seed s ∈ {0, 1}, and outputs a bit nmExt(X, s) that is ε-close to uniform, even given the seed s and the value nmExt(X, s′) for an adversarially chosen seed s′ 6= s. Dodis and Wichs (STOC 2009) showed the existence of (k, ε)-no...
متن کاملNon-Malleable Extractors for Entropy Rate <1/2
Dodis and Wichs [DW09] introduced the notion of a non-malleable extractor to study the problem of privacy amplification with an active adversary. A non-malleable extractor is a much stronger version of a strong extractor. Given a weakly-random string x and a uniformly random seed y as the inputs, the non-malleable extractor nmExt has the property that nmExt(x, y) appears uniform even given y as...
متن کاملLow-error, two-source extractors assuming efficient non-malleable extractors
We show a reduction from explicit two-source extractors with small error and arbitrarily small constant entropy rate to the existence of explicit t-non-malleable extractors with a small seed length. Previously, such a reduction was known either when one source had entropy rate above half [Raz05] or for general entropy rates but only for large error [CZ16]. As in previous reductions we start wit...
متن کاملNon-malleable Codes from Two-Source Extractors
We construct an efficient information-theoretically non-malleable code in the splitstate model for one-bit messages. Non-malleable codes were introduced recently by Dziembowski, Pietrzak and Wichs (ICS 2010), as a general tool for storing messages securely on hardware that can be subject to tampering attacks. Informally, a code (Enc :M→ L×R,Dec : L × R → M) is non-malleable in the split-state m...
متن کاملNon-Malleable Extractors with Logarithmic Seeds
We construct non-malleable extractors with seed length d = O(log n+log(1/ε)) for n-bit sources with min-entropy k = Ω(d), where ε is the error guarantee. In particular, the seed length is logarithmic in n for ε > 2−(logn) 1/3 . This improves upon existing constructions that either require super-logarithmic seed length even for constant error guarantee, or otherwise only support min-entropy n/po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2946896